The pessimistic diagnosabilities of some general regular graphs
نویسندگان
چکیده
منابع مشابه
Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs
Article history: Received 7 February 2017 Received in revised form 28 April 2017 Accepted 30 May 2017 Available online 7 June 2017 Communicated by S.-Y. Hsieh
متن کاملOn computing the general Narumi-Katayama index of some graphs
The Narumi-Katayama index was the first topological index defined by the product of some graph theoretical quantities. Let $G$ be a simple graph with vertex set $V = {v_1,ldots, v_n }$ and $d(v)$ be the degree of vertex $v$ in the graph $G$. The Narumi-Katayama index is defined as $NK(G) = prod_{vin V}d(v)$. In this paper, the Narumi-Katayama index is generalized using a $n$-ve...
متن کاملConstructions of antimagic labelings for some families of regular graphs
In this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.
متن کاملGeneral Bounds for Identifying Codes in Some Infinite Regular Graphs
Consider a connected undirected graph G = (V,E) and a subset of vertices C. If for all vertices v ∈ V , the sets Br(v) ∩ C are all nonempty and pairwise distinct, where Br(v) denotes the set of all points within distance r from v, then we call C an r-identifying code. We give general lower and upper bounds on the best possible density of r-identifying codes in three infinite regular graphs.
متن کاملSome strongly regular graphs with the parameters of Paley graphs
We construct two-intersection sets in PG(5, q), q odd, admitting PSL(2, q), whose associated strongly regular graphs have the same parameters as, but are not isomorphic to, Paley graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.10.025